Detecting Sybils in Peer-to-Peer File Replication Systems
نویسندگان
چکیده
The test of a peer-to-peer file sharing network is how efficiently the objects are discovered and retrieved. One of the most important factors that contribute towards this is optimal replication of the objects across the network. One of the security threats to replication model is Sybil attack. In this paper we propose an approach that aims at detecting sybil identities in peer-to-peer file sharing networks. The sybils can corrupt, hide or destroy the replicas in file sharing network. This approach makes use of the fact that sybil doesn’t scale its storage to the factor of its identities. The approach safeguards the availability and accessibility of objects in a peer-to-peer network from sybil attack. Experimental evaluations have shown that our approach works very efficiently in detecting sybils. More than 50% of the sybils were detected in first few seconds of the simulation and loss or damage of objects is reduced to less than
منابع مشابه
SyMon: A practical approach to defend large structured P2P systems against Sybil Attack
Sybil attack is one of the most challenging problems that plague current decentralized Peer-toPeer(P2P) systems. In Sybil attack, a single malicious user creates multiple peer identities known as sybils. These sybils are employed to target honest peers and hence subvert the system. In this paper, we describe a novel solution that enables all honest peers to protect themselves from sybils with h...
متن کاملP2P Network Trust Management Survey
Peer-to-peer applications (P2P) are no longer limited to home users, and start being accepted in academic and corporate environments. While file sharing and instant messaging applications are the most traditional examples, they are no longer the only ones benefiting from the potential advantages of P2P networks. For example, network file storage, data transmission, distributed computing, and co...
متن کاملManipulating Scrip Systems: Sybils and Collusion
Game-theoretic analyses of distributed and peer-to-peer systems typically use the Nash equilibrium solution concept, but this explicitly excludes the possibility of strategic behavior involving more than one agent. We examine the effects of two types of strategic behavior involving more than one agent, sybils and collusion, in the context of scrip systems where agents provide each other with se...
متن کاملPopularity-Based Replication Strategy in Unstructured P2P File Sharing Systems
Peer-to-Peer (P2P) networks have shown to be an efficient and successful mechanism for file sharing over the internet. The unstructured P2P systems usually use a blind search method to find the requested data object. Observations have shown that a few of peers share most of data. In order to increase the success rate of blind search and data availability and load balancing, replication techniqu...
متن کاملAn Identity-Based Security for Nodes in EAD File Replication in P2P Systems
An Efficient and Adaptive Decentralized (EAD) file replication algorithm achieves high query efficiency and high replica utilization. EAD enhances the utilization of file replicas by selecting query traffic hubs and frequent requesters as replica nodes, and dynamically adapting to non uniform and time-varying file popularity and node interest. EAD creates and deletes replicas in a decentralized...
متن کامل